Testing Convex Position ∗ †
نویسندگان
چکیده
In this paper we present a property tester for the convex position property of points sets. Our property tester queries the input set P of n points in Rd in O( d+1 √ nd/ ) random points and distinguishes between the case when P is in convex position and the case when one has to modify at least an -fraction of the points in P to obtain a set of points in convex position. We also show that the complexity of our algorithm is asymptotically optimal in that every property tester for convex position must query Ω( d+1 √ nd/ ) points.
منابع مشابه
Comparison of supraspinatus sonographic thickness in empty can, full can and hug up testing positions in healthy women
Background: Rotator cuff injuries are the most common causes of shoulder pain and supraspinatus muscle is usually involved. Clinical tests are available and inexpensive tools for assessment of shoulder dysfunctions. The empty can (EC) and full can (FC) tests are considered as shoulder gold standard tests. Recently, hug up (HU) test has been developed to assess the supraspinatus. So far, no ultr...
متن کاملErdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
The Erdős-Szekeres theorem states that, for every k, there is a number nk such that every set of nk points in general position in the plane contains a subset of k points in convex position. If we ask the same question for subsets whose convex hull does not contain any other point from the set, this is not true: as shown by Horton, there are sets of arbitrary size that do not contain an empty 7-...
متن کاملFinding Convex Sets in Convex Position
Let F denote a family of pairwise disjoint convex sets in the plane. F is said to be in convex position, if none of its members is contained in the convex hull of the union of the others. For any xed k 5, we give a linear upper bound on P k (n), the maximum size of a family F with the property that any k members of F are in convex position, but no n are.
متن کاملErdős - Szekeres is NP - hard in 3 dimensions - and what now ?
The Erdős-Szekeres theorem states that, for every k, there is a number nk such that every set of nk points in general position in the plane contains a subset of k points in convex position. If we ask the same question for subsets whose convex hull does not contain any other point from the set, this is not true: as shown by Horton, there are sets of arbitrary size that do not contain an empty 7-...
متن کاملOn an empty triangle with the maximum area in planar point sets
We deal with only finite point sets P in the plane in general position. A point set is convex or in convex position if it determines a convex polygon. A convex subset Q of P is said to be empty if no point of P lies inside the convex hull of Q. An empty convex subset of P with k elements is also called a k-hole of P . Let P be an n planar point set in general position. For a subset Q of P , den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000